VLSI Architectures for Multiplication in GF(2m) for Application Tailored Digital Signal Processors
نویسندگان
چکیده
Finite Field Arithmetic plays an important role in coding theory, cryptography and their applications. Several hardware solutions using Finite Field Arithmetic have already been developed but none of them are user programmable. This is probably one reason why BCH codes are not commonly used in mobile communication applications even though these codes have very desirable properties regarding burst error correction. This work presents architectures for multiplication in GF(2m) applicable to Digital Signal Processors. First a method is proposed to build an array of gates for hardware multiplication in GF(2m). Then an approach will be shown that combines the hardware of a typical standard binary arithmetic multiplier with a GF(2m) multiplier. Using this approach saves a considerable number of gates and decreases the bus load while increasing the latency of the standard binary multiplier unit only marginally. Finally, a solution of a combined 17x17 integer / GF(2m≤8) multiplier is presented and discussed.
منابع مشابه
VLSI architecture for datapath integration of arithmetic over GF(2 m) on digital signal processors
This paper examines the implementation of Finite Field arithmetic, i.e. multiplication, division, and exponentiation, for any standard basis GF(2m) with m≤8 on a DSP datapath. We introduce an opportunity to exploit cells and the interconnection structure of a typical binary multiplier unit for the Finite Field operations by adding just a small overhead of logic. We develop division and exponent...
متن کاملLow-Complexity Parallel Systolic Montgomery Multipliers over GF(2m) Using Toeplitz Matrix-Vector Representation
In this paper, a generalized Montgomery multiplication algorithm in GF(2m) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pentanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15% compared with an...
متن کاملDesign and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL
A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. 
The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of fu...
متن کاملDesign and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL
A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of func...
متن کاملNew AB2 Multiplier over GF(2m) using Cellular Automata
AB multiplication over GF(2) is an essential operation in modular exponentiation, which is the basic computation for most public key crypto systems. The current paper presents a new architecture that can perform AB multiplication over GF(2) in m clock cycles using a cellular automata. Since cellular automata architecture is simple, regular, modular, and cascadable, it can be utilized efficientl...
متن کامل